Grid Vertex-Unfolding Orthostacks
نویسندگان
چکیده
∗A preliminary version of this paper appeared in Revised Selected Papers from the Japan Conference on Discrete and Computational Geometry, Tokyo, Oct. 2004, LNCS 3742, 2005, pages 76–82. †Research supported in part by NSF grants CCF-0347776, OISE-0334653, and CCF-0430849, and by DOE grant DE-FG02-04ER25647. ‡Research supported in part by NSF grants OISE-0334653 and CCF-0430849. §Chercheur qualifié du FNRS. aA polyhedron (without boundary) is an embedded connected polyhedral complex without boundary, i.e., a connected set of polygons in Euclidean 3-space such that (1) every two polygons meet
منابع مشابه
Unfolding Rectangle-Faced Orthostacks
We prove that rectangle-faced orthostacks, a restricted class of orthostacks, can be grid-edge unfolded without additional refinement. We prove several lemmas applicable to larger classes of orthostacks, and construct an example to illustrate that our algorithm does not directly extend to more general classes of orthostacks.
متن کاملGrid Vertex-Unfolding Orthogonal Polyhedra
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid edges induced by coordinate planes passing through every vertex. A vertexunfolding permits faces in the net to be connected at single vertices, not necessarily along edges. We show that any orthogona...
متن کاملUnfolding some classes of orthogonal polyhedra
In this paper, we study unfoldings of orthogonal polyhedra. More precisely, we deene two special classes of orthogonal polyhedra, orthostacks and orthotubes, and show how to generate unfoldings by cutting faces, such that the resulting surfaces can be attened into a single connected polygon.
متن کاملUnfolding Orthogonal Terrains
It is shown that every orthogonal terrain, i.e., an orthogonal (rightangled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece by cutting along grid edges defined by coordinate planes through every vertex.
متن کاملUnfolding Manhattan Towers
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4×5×1 refinement of the vertex grid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 20 شماره
صفحات -
تاریخ انتشار 2004